Complexity of a Disjoint Matching Problem on Bipartite Graphs
نویسنده
چکیده
We consider the following question: given an (X, Y )-bigraph G and a set S ⊆ X, does G contain two disjoint matchings M1 and M2 such that M1 saturates X and M2 saturates S? When |S| ≥ |X| − 1, this question is solvable by finding an appropriate factor of the graph. In contrast, we show that when S is allowed to be an arbitrary subset of X, the problem is NP-hard.
منابع مشابه
Connected matchings in chordal bipartite graphs
A connected matching in a graph is a collection of edges that are pairwise disjoint but joined by another edge of the graph. Motivated by applications to Hadwiger’s conjecture, Plummer, Stiebitz, and Toft [13] introduced connected matchings and proved that, given a positive integer k, determining whether a graph has a connected matching of size at least k is NPcomplete. Cameron [4] proved that ...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملApproximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight
:' We consider the problem of covering a weighted graph G = (V, E) by a set of " vertex-disjoint paths, such that the total weight of these paths is maximized. This problem is clearly NP-complete, since it contain's the Hamiltonian path problem as a special case. Three approximation algorithms for this problem are presented, exhibiting a complexity-performance trade-off. First, we develop an al...
متن کاملNew results on maximum induced matchings in bipartite graphs and beyond
The maximum induced matching problem is known to be APX-hard in the class of bipartite graphs. Moreover, the problem is also intractable in this class from a parameterized point of view, i.e. it is W[1]-hard. In this paper, we reveal several classes of bipartite (and more general) graphs for which the problem admits fixed-parameter tractable algorithms. We also study the computational complexit...
متن کاملShortest Disjoint S-Paths Via Weighted Linear Matroid Parity
Mader’s disjoint S-paths problem unifies two generalizations of bipartite matching: (a) nonbipartite matching and (b) disjoint s–t paths. Lovász (1980, 1981) first proposed an efficient algorithm for this problem via a reduction to matroid matching, which also unifies two generalizations of bipartite matching: (a) non-bipartite matching and (c) matroid intersection. While the weighted versions ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 116 شماره
صفحات -
تاریخ انتشار 2016